A relational syllogistic

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The propositional and relational syllogistic∗

In this paper it is shown how syllogistic reasoning can be extended to account for propositional logic and relations.

متن کامل

Logics for the Relational Syllogistic

The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause...

متن کامل

A System of Relational Syllogistic Incorporating Full Boolean Reasoning

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some a are R-related to some b; Some a are R-related to all b; All a are R-related to some b; All a are R-related to all b. Such primitives formalize sentences from natural language like ‘All students read some textbooks’. Here a, b denote arbitrary sets (of objects), ...

متن کامل

Generating Ontologies from Relational Data with Fuzzy-Syllogistic Reasoning

Existing standards for crisp description logics facilitate information exchange between systems that reason with crisp ontologies. Applications with probabilistic or possibilistic extensions of ontologies and reasoners promise to capture more information, because they can deal with more uncertainties or vagueness of information. However, since there are no standards for either extension, inform...

متن کامل

Tableau-Based Model Generation for Relational Syllogistic Logics

I present an analytic tableau system for a small fragment of natural language called RC. RC is an extension of the classical Aristotelian syllogisms (“All computer-scientists are mathematicians”) to include relations in the form of transitive verbs (“All who hate all logic programmers know some who hate all proof theoreticians”) and to permit the negation of nouns (“Some non-linguists love all ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logic and Logical Philosophy

سال: 2004

ISSN: 1425-3305

DOI: 10.12775/llp.2004.008